Algorithm 1020: Computation of Multi-Degree Tchebycheffian B-Splines
نویسندگان
چکیده
Multi-degree Tchebycheffian splines are with pieces drawn from extended (complete) Tchebycheff spaces, which may differ interval to interval, and possibly of different dimensions. These a natural extension multi-degree polynomial splines. Under quite mild assumptions, they can be represented in terms so-called B-spline (MDTB-spline) basis; such basis possesses all the characterizing properties classical basis. We present practical framework compute MDTB-splines, provide an object-oriented implementation Matlab . The supports construction, differentiation, visualization MDTB-splines whose belong spaces that null-spaces constant-coefficient linear differential operators. construction relies on extraction operator maps local Bernstein functions MDTB-spline interest.
منابع مشابه
Fast Computation of Exponential B-splines
This paper proposes a fast method for the calculation of exponential B-splines sampled at regular intervals. This algorithm is based on a combination of FIR and IIR filters which enables a fast decomposition and reconstruction of a signal. When complex values are selected for the parameters of the exponentials, complex trigonometric functions are obtained. Only the real part of these functions ...
متن کاملKnot intervals and multi-degree splines
This paper studies the merits of using knot interval notation for B-spline curves, and presents formulae in terms of knot intervals for common B-spline operations such as knot insertion, differentiation, and degree elevation. Using knot interval notation, the paper introduces MD-splines, which are B-spline-like curves that are comprised of polynomial segments of various degrees (MD stands for “...
متن کاملNon-uniform subdivision for B-splines of arbitrary degree
We present an efficient algorithm for subdividing non-uniform B-splines of arbitrary degree in a manner similar to the Lane-Riesenfeld subdivision algorithm for uniform Bsplines of arbitrary degree. Our algorithm consists of doubling the control points followed by d rounds of non-uniform averaging similar to the d rounds of uniform averaging in the Lane-Riesenfeld algorithm for uniform B-spline...
متن کاملA symmetric, non-uniform, refine and smooth subdivision algorithm for general degree B-splines
Subdivision surfaces would find a greater number of applications if there was a scheme that included general degree NURBS as a special case. As a step towards such a scheme, we present a univariate refine and smooth subdivision algorithm that applies directly to regular regions of a surface and might, in future work, be generalised to incorporate extraordinary points. The algorithm is symmetric...
متن کاملOn Higher Degree F-transforms Based on B-splines
s of MMA2015, May 26–29, 2015, Sigulda, Latvia c © 2015 ON HIGHER DEGREE F-TRANSFORMS BASED ON B-SPLINES MARTINS KOKAINIS and SVETLANA ASMUSS 1 Department of Mathematics, University of Latvia Zeļļu iela 8, R̄ıga, LV-1002, Latvia 2 Institute of Mathematics and Computer Science, University of Latvia Raiņa bulvāris 29, R̄ıga, LV-1459, Latvia E-mail: [email protected], [email protected] The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 2022
ISSN: ['0098-3500', '1557-7295']
DOI: https://doi.org/10.1145/3478686